Gap Functions and Algorithms for Variational Inequality Problems
نویسندگان
چکیده
منابع مشابه
Algorithms for Bilevel Pseudomonotone Variational Inequality Problems
We propose easily implementable algorithms for minimizing the norm with pseudomonotone variational inequality constraints. This bilevel problem arises in the Tikhonov regularization method for pseudomonone variational inequalities. Since the solution set of the lower variational inequality is not given explicitly, the available methods of mathematical programming and variational inequality can ...
متن کاملGap Functions and Descent Methods for Minty Variational Inequality
A new class of gap functions associated to the variational inequality introduced by Minty is defined. Descent methods for the minimization of the gap functions are analysed in order to develop exact and inexact line-search algorithms for solving strictly and strongly monotone variational inequalities, respectively.
متن کاملError Bounds of Generalized D-Gap Functions for Nonsmooth and Nonmonotone Variational Inequality Problems
We present some error bound results of generalized D-gap functions for nonsmooth and nonmonotone variational inequality (VI) problems. Application is given in providing a derivative-free descent method.
متن کاملError bounds of regularized gap functions for weak vector variational inequality problems
where C ⊆ Rm is a closed convex and pointed cone with nonempty interior intC. (WVVI) was firstly introduced by Giannessi []. It has been shown to have many applications in vector optimization problems and traffic equilibrium problems (e.g., [, ]). Error bounds are to depict the distance from a feasible solution to the solution set, and have played an important role not only in sensitivity an...
متن کاملMerit Functions and Descent Algorithms for a Class of Variational Inequality Problems
We consider a variational inequality problem, where the cost mapping is the sum of a single-valued mapping and the subdifferential mapping of a convex function. For this problem we introduce a new class of equivalent optimization formulations; based on them, we also provide the first convergence analysis of descent algorithms for the problem. The optimization formulations constitute generalizat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2013
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2013/965640